The Adept K-Nearest Neighbour Algorithm - An optimization to the Conventional K-Nearest Neighbour Algorithm
نویسندگان
چکیده
منابع مشابه
Extending the K-Nearest Neighbour Classification Algorithm to Symbolic Objects
Riassunto: L’analisi di dati simbolici generalizza alcuni metodi statistici standard al caso di oggetti simbolici (SO). Questi oggetti, informalmente definiti “dati aggregati”, poiché sintetizzano le informazioni relative ad un gruppo di individui, possono essere confrontati al fine di individuare dei cluster, di classificarli o ordinarli in base al loro grado di generalizzazione. L’articolo pr...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملGeneralized K-Nearest Neighbour Algorithm- A Predicting Tool
k-nearest neighbour algorithm is a non-parametric machine learning algorithm generally used for classification. It is also known as instance based learning or lazy learning. K-NN algorithm can also be adapted for regression that is for estimating continuous variables. In this research paper the researcher endow with a generalized K-nearest algorithm used for predicting a continuous value. In or...
متن کاملArabic text classification using k-nearest neighbour algorithm
Many algorithms have been implemented to the problem of Automatic Text Categorization (ATC). Most of the work in this area has been carried out on English texts, with only a few researchers addressing Arabic texts. We have investigated the use of the K-Nearest Neighbour (K-NN) classifier, with an Inew, cosine, jaccard and dice similarities, in order to enhance Arabic ATC. We represent the datas...
متن کاملExtending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Many pattern recognition tasks make use of the k nearest neighbour (k–NN) technique. In this paper we are interested on fast k– NN search algorithms that can work in any metric space i.e. they are not restricted to Euclidean–like distance functions. Only symmetric and triangle inequality properties are required for the distance. A large set of such fast k–NN search algorithms have been develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions on Machine Learning and Artificial Intelligence
سال: 2016
ISSN: 2054-7390
DOI: 10.14738/tmlai.41.1876